Parallel Search, Incentives and Problem Type:
نویسندگان
چکیده
Kevin J. Boudreau HEC Paris Nicola Lacetera Case Western Reserve University Karim R. Lakhani Harvard Business School This paper presents econometric evidence of two independent effects of adding more competitors on innovation: 1) a competition effect whereby increasing rivalry shapes, and often decreases, incentives to expend effort and invest in innovation; and 2) a parallel search effect whereby adding greater numbers of “searchers” benefits innovation by broadening the search for solutions. We further show the importance of these effects depends on the nature of the innovation problem being solved. The analysis uses data from TopCoder’s software contest platform, on which elite software developers were assigned different problems to solve within assigned groups of direct competitors. Econometric relationships are identified by exploiting random assignment and a separate instrumental variables procedure.
منابع مشابه
A Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect
Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...
متن کاملParallel Search, Incentives and Problem Type: Revisiting the Competition and Innovation Link
متن کامل
New Formulation and Solution in PCB Assembly Systems with Parallel Batch processors
This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-in...
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملحل مسئله زمان بندی ماشینهای موازی نامرتبط با اهداف کل زودکرد وزنی و کل دیرکرد وزنی با استفاده از الگوریتم جستجوی پراکنده چند هدفه
The parallel machine scheduling problem is an important and difficult problem to be considered in the real-world situations. Traditionally, this problem consists of the scheduling of a set of independent jobs on parallel machines with the aim of minimizing the maximum job completion. In today's manufacturing systems, in which both early and tardy finishing of job processing are undesired, the o...
متن کامل